Parallel performance of algebraic multigrid domain decomposition

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain Decomposition Based High Performance Parallel Computing

The study deals with the parallelization of finite element based Navier-Stokes codes using domain decomposition and state-ofart sparse direct solvers. There has been significant improvement in the performance of sparse direct solvers. Parallel sparse direct solvers are not found to exhibit good scalability. Hence, the parallelization of sparse direct solvers is done using domain decomposition t...

متن کامل

Domain Decomposition vs. Concurrent Multigrid Domain Decomposition vs. Concurrent Multigrid 1

We compare the performance on a concurrent computer of two domaindecomposition methods and a full-multigrid method for solving the Poisson equation on a square. Independent of the granularity of the computation, domain decomposition is almost always signi cantly slower than multigrid. Our largest computations use a multicomputer with 128 nodes to solve a problem on a 2048 2048 grid. In these co...

متن کامل

Reducing Complexity in Parallel Algebraic Multigrid Preconditioners

Algebraic multigrid (AMG) is a very efficient iterative solver and preconditioner for large unstructured linear systems. Traditional coarsening schemes for AMG can, however, lead to computational complexity growth as problem size increases, resulting in increased memory use and execution time, and diminished scalability. Two new parallel AMG coarsening schemes are proposed, that are based on so...

متن کامل

Parallel algebraic multigrid based on subdomain blocking

The algebraic multigrid AMG approach provides a purely algebraic means to tackle the e cient solution of systems of equations posed on large unstructured grids in D and D While sequential AMG has been used for increasingly large problems with several million unknowns its application to even larger applications requires a parallel version Since in contrast to geometric multigrid the hierarchy of...

متن کامل

Distance-two interpolation for parallel algebraic multigrid

Algebraic multigrid (AMG) is one of the most efficient and scalable parallel algorithms for solving sparse linear systems on unstructured grids. However, for large 3D problems, the coarse grids that are normally used in AMG often lead to growing complexity in terms of memory use and execution time per AMG V-cycle. Sparser coarse grids, such as those obtained by the parallel modified independent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Linear Algebra with Applications

سال: 2020

ISSN: 1070-5325,1099-1506

DOI: 10.1002/nla.2342